On the Construction of Quantum and LCD Codes from Cyclic Codes over the Finite Commutative Rings

نویسندگان

چکیده

Let Fq be a field of order q, where q is power an odd prime p, and α β are two non-zero elements Fq. The primary goal this article to study the structural properties cyclic codes over finite ring R=Fq[u1,u2]/⟨u12−α2,u22−β2,u1u2−u2u1⟩. We decompose R by using orthogonal idempotents Δ1,Δ2,Δ3, Δ4 as R=Δ1R⊕Δ2R⊕Δ3R⊕Δ4R, construct quantum-error-correcting (QEC) R. As application, we some optimal LCD codes.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Additive cyclic codes over finite commutative chain rings

Additive cyclic codes over Galois rings were investigated in [3]. In this paper, we investigate the same problem but over a more general ring family, finite commutative chain rings. When we focus on non-Galois finite commutative chain rings, we observe two different kinds of additivity. One of them is a natural generalization of the study in [3], whereas the other one has some unusual propertie...

متن کامل

Cyclic codes over finite rings

It is well known that cyclic linear codes of length n over a (finite) field F can be characterized in terms of the factors of the polynomial x"-1 in F[x]. This paper investigates cyclic linear codes over arbitrary (not necessarily commutative) finite tings and proves the above characterization to be true for a large class of such codes over these rings. (~) 1997 Elsevier Science B.V. All rights...

متن کامل

Quantum Codes from Linear Codes over Finite Chain Rings

In this paper, we provide two methods of constructing quantum codes from linear codes over finite chain rings. The first one is derived from the Calderbank-ShorSteane (CSS) construction applied to self-dual codes over finite chain rings. The second construction is derived from the CSS construction applied to Gray images of the linear codes over finite chain ring Fp2m + uFp2m. The good parameter...

متن کامل

On Skew Cyclic Codes over a Finite Ring

In this paper, we classify the skew cyclic codes over Fp + vF_p + v^2F_p, where p is a prime number and v^3 = v. Each skew cyclic code is a F_p+vF_p+v^2F_p-submodule of the (F_p+vF_p+v^2F_p)[x;alpha], where v^3 = v and alpha(v) = -v. Also, we give an explicit forms for the generator of these codes. Moreover, an algorithm of encoding and decoding for these codes is presented.

متن کامل

Cyclic Codes over Some Finite Rings

In this paper cyclic codes are established with respect to the Mannheim metric over some finite rings by using Gaussian integers and the decoding algorithm for these codes is given. AMS Classification: 94B05, 94B60

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Axioms

سال: 2023

ISSN: ['2075-1680']

DOI: https://doi.org/10.3390/axioms12040367